struct ListNode* middleNode(struct ListNode* head){
     struct ListNode *fast=head,*slow=head;
    if(!head)return true;
    //找链表中间
    while(fast)
    {
        fast=fast->next;
        if(!fast)break;
        fast=fast->next;
        slow=slow->next;
    }
    return slow;
}